On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
نویسندگان
چکیده
منابع مشابه
Inexact block coordinate descent methods with application to the nonnegative matrix factorization
This work is concerned with the cyclic block coordinate descent method, or nonlinear Gauss-Seidel method, where the solution of an optimization problem is achieved by partitioning the variables in blocks and successively minimizing with respect to each block. The properties of the objective function that guarantee the convergence of such alternating scheme have been widely investigated in the l...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملRelaxation methods for problems with strictly convex separable costs and linear constraints
We consider the minimization problem with strictly convex, possibly nondifferentiable, separable cost and linear constraints. The dual of this problem is an unconstrained minimization problem with differentiable cost which is well suited for solution by parallel methods based on Gauss-Seidel relaxation. We show that these methods yield the optimal primal solution and, under additional assumptio...
متن کاملA Gauss - Seidel Type Solver for Special Convex Programs , with Application to Frictional Contact
An iterative method is described that solves the constrained min-imisation of a convex function, when the constraints g j (x 1 ; ::; x n) 0 are function of only a few variables and can be partitioned in some way. A proof of convergence is given which is based on the fact that the function values that are generated decrease. The relation to the non-linear equation solver TanGS VKL93] is shown, t...
متن کاملAsynchronous parallel primal-dual block update methods
Recent several years have witnessed the surge of asynchronous (async-) parallel computing methods due to the extremely big data involved in many modern applications and also the advancement of multi-core machines and computer clusters. In optimization, most works about async-parallel methods are on unconstrained problems or those with block separable constraints. In this paper, we propose an as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 2000